GCD Computations Modulo Regular Chains
نویسندگان
چکیده
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations based on modular methods and fast polynomial arithmetic. We rely on new results connecting polynomial subresultants and GCDs modulo regular chains. We report on extensive experimentation, comparing our code to pre-existing Maple implementations, as well as more optimized Magma functions. In most cases, our new code outperforms the other packages by several orders of magnitude.
منابع مشابه
A Gcd-Sum Function Over Regular Integers Modulo n
We introduce a gcd-sum function involving regular integers (mod n) and prove results giving its minimal order, maximal order and average order.
متن کاملOn Triangular Decompositions of Algebraic Varieties
Different kinds of triangular decompositions of algebraic varieties are presented. The main result is an efficient method for obtaining them. Our strategy is based on a lifting theorem for polynomial computations modulo regular chains.
متن کاملContribution à l'algorithmique en algèbre différentielle
This thesis is dedicated to the study of nonlinear partial differential equations systems. The chosen approach is using differential algebra. Given a system of differential equations, we seek information about its solutions. TO do SO, we first compute particular systems (called differential regular chains) such that the union of their solutions coincide with the solutions of the initial system....
متن کاملOn the Regularity Property of Differential Polynomials Modulo Regular Differential Chains
This paper provides an algorithm which computes the normal form of a rational differential fraction modulo a regular differential chain if, and only if, this normal form exists. A regularity test for polynomials modulo regular chains is revisited in the nondifferential setting and lifted to differential algebra. A new characterization of regular chains is provided.
متن کاملInversion Modulo Zero-Dimensional Regular Chains
We consider the questions of inversion modulo a regular chain in dimension zero and of matrix inversion modulo such a regular chain. We show that a well-known idea, Leverrier’s algorithm, yields new results for these questions.
متن کامل